The UNITY Formalism
نویسندگان
چکیده
1 The Basic UNITY Theory 7 1.0.1 The abstract type of programs . . . . . . . . . . . . . . . 8 1.0.2 Inspectors for type ”program” . . . . . . . . . . . . . . . 8 1.0.3 Equality for UNITY programs . . . . . . . . . . . . . . . 8 1.0.4 co . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 1.0.5 Union . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 1.0.6 Intersection . . . . . . . . . . . . . . . . . . . . . . . . . . 10 1.0.7 unless . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 1.0.8 stable . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 1.0.9 Union . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 1.0.10 Intersection . . . . . . . . . . . . . . . . . . . . . . . . . . 11 1.0.11 invariant . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 1.0.12 increasing . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 1.0.13 Theoretical Results from Section 6 . . . . . . . . . . . . . 12 1.0.14 Ad-hoc set-theory rules . . . . . . . . . . . . . . . . . . . 12 1.1 Partial versus Total Transitions . . . . . . . . . . . . . . . . . . . 12 1.1.1 Basic properties . . . . . . . . . . . . . . . . . . . . . . . 13 1.2 Rules for Lazy Definition Expansion . . . . . . . . . . . . . . . . 14 1.2.1 Inspectors for type ”program” . . . . . . . . . . . . . . . 14
منابع مشابه
A UNITY-Based Formalism for Dynamic Distributed Systems
We describe Dynamic UNITY, a new formalism for the specification of dynamic distributed systems based on the UNITY formalism. This formalism allows for the specification and proof of systems where processes may be created and destroyed, and where communication links among processes may change. It also introduces asynchronous messaging as a primitive construct, to facilitate the composition of m...
متن کاملA Logic for Synchronous Transitions with Dynamic Connict Detection
This paper introduces a formalism named DSYNC aimed at the design and ver-iication of synchronous concurrent systems. The components of this formalism are a transition system and a rst-order linear-time temporal logic. It adopts a synchronous computation model with dynamic write-connict detection, and it handles non-termination and compositional proofs. This paper also discusses some of the pra...
متن کاملSpecification and Verification of the ATMR Protocol Using Unity. Part 1: Modeling and Specification of the Protocol
We propose a complete description and validation of the ATMR protocol within the UNITY formalism. An operational description using the UNITY programming notation is given as well as a specification of the main correctness properties in the UNITY temporal logic. This formal description helps to understand precisely the mechanisms this protocol involves. In particular, we have noted the use of a ...
متن کاملar X iv : q - a lg / 9 60 50 33 v 1 2 1 M ay 1 99 6 CRM - 2278 March 1995 q - Ultraspherical Polynomials for q a Root of Unity
Properties of the q-ultraspherical polynomials for q being a primitive root of unity are derived using a formalism of the soq(3) algebra. The orthogonality condition for these polynomials provides a new class of trigonometric identities representing discrete finite-dimensional analogs of q-beta integrals of Ramanujan. Mathematics Subject Classifications (1991). 17B37, 33D80
متن کاملImpUNITY: UNITY with Procedures and Local Variables
In this paper we present the ImpUNITY framework, a framework that supports the development of parallel and distributed programs from speciication to implementation in a stepwise manner. The ImpUNITY framework is an extension of UNITY, as introduced by Chandy and Misra, with features of the Action System formalism of Back and Kurki-Suonio. Due to this extension, the ImpUNITY framework is more su...
متن کامل